Generalized edge-chromatic numbers and additive hereditary properties of graphs
نویسندگان
چکیده
An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphisms. Let P and Q be hereditary properties of graphs. The generalized edge-chromatic number ρQ(P) is defined as the least integer n such that P ⊆ nQ. We investigate the generalized edge-chromatic numbers of the properties → H, Ik, Ok, W∗ k , Sk and Dk.
منابع مشابه
Generalized chromatic numbers and additive hereditary properties of graphs
An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphisms. Let P and Q be additive hereditary properties of graphs. The generalized chromatic number χQ(P) is defined as follows: χQ(P) = n iff P ⊆ Qn but P 6⊆ Qn−1. We investigate the generalized chromatic numbers of the well-known properties of graphs Ik, Ok, Wk, Sk and Dk.
متن کاملFractional Q-edge-coloring of Graphs
An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let Q be an additive hereditary property of graphs. A Q-edge-coloring of a simple graph is an edge coloring in which the edges colored with the same color induce a subgraph of property Q. In this paper we present some results on fractional Q-edge-colorings. We determine...
متن کاملOn the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملOn Generalized Coprime Graphs
Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.
متن کاملGeneralized fractional total coloring of complete graphs
An additive and hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let P and Q be two additive and hereditary graph properties and let r, s be integers such that r ≥ s. Then an r s -fractional (P,Q)-total coloring of a finite graphG = (V,E) is a mapping f , which assigns an s-element subset of the set {1, 2, . . . , r} to each vert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 22 شماره
صفحات -
تاریخ انتشار 2002